منابع مشابه
Recognizing ω-regular Languages with Probabilistic Automata
Probabilistic finite automata as acceptors for languages over finite words have been studied by many researchers. In this paper, we show how probabilistic automata can serve as acceptors for ω-regular languages. Our main results are that our variant of probabilistic Büchi automata (PBA) is more expressive than non-deterministic ω-automata, but a certain subclass of PBA, called uniform PBA, has ...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملAutonomous robot navigation using optimal control of probabilistic regular languages
This paper addresses autonomous intelligent navigation of mobile robotic platforms based on the recently reported algorithms of language-measure-theoretic optimal control. Real-time sensor data and model-based information on the robot’s motion dynamics are fused to construct a probabilistic finite state automaton model that dynamically computes a time-dependent discrete-event supervisory contro...
متن کاملComputation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syntactic pattern matching and machine learning. In most cases, only pairs of probabilistic regular languages were considered. In this paper we extend previous results to pairs of languages generated by a probabilistic co...
متن کاملSynchronized Shuue and Regular Languages Synchronized Shuue and Regular Languages
New representation results for three families of regular languages are stated, using a special kind of shuue operation, namely the synchronized shuue. First, it is proved that the family of regular star languages is the smallest family containing the language (a + bc) and closed under synchronized shuue and length preserving morphism. The second representation result states that the family of "...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1973
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(73)90895-4